2 Head - Strictness Is Not Definable
نویسنده
چکیده
A property P of a language is said to be deenable by abstract interpretation if there is a monotonic map abs from the domain of standard semantics to an abstract domain A of nite height, and a partition of the abstract domain into two parts A P and A non-P , such that any value has property P if and only if abs maps it to an element of A P. Head-strictness is a property of functions over lists which asserts, roughly speaking, that whenever the function looks at some preex of a list, it looks every element in that preex. We prove that head-strictness is not deenable by abstract interpretation.
منابع مشابه
Higher Order Demand Propagation
In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non-strict functional language, which has a polymorphic type system and supports higher order functions and user definable algebraic data types. This report defines a semantics for higher order demand propagation and relates it to...
متن کاملThe Impact of Laziness on Parallelism and the Limits of Strictness Analysis
The major question examined by this paper is whether suucient ne-grain parallelism can be obtained from programs written in a lazy functional language. To answer this question, we have implemented a prototype compiler based on a novel approach to strictness analysis (called abstract demand propagation) and we have compared this implementation strategy (optimized lazy) with other implementations...
متن کاملThe Impact of Laziness on Parallelism and the Limits of StrictnessAnalysisG
The major question examined by this paper is whether suucient ne-grain parallelism can be obtained from programs written in a lazy functional language. To answer this question, we have implemented a prototype compiler based on a novel approach to strictness analysis (called abstract demand propagation) and we have compared this implementation strategy (optimized lazy) with other implementations...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOptionality and Gradience in Persian Phonology: An Optimality Treatment
The distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. An organized survey was conducted to elicit the judgments of 37 native Persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. The results showed that the differences in judgment between the various categories are not just t...
متن کامل